Semiring induced valuation algebras: Exact and approximate local computation algorithms
نویسندگان
چکیده
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this algebraic structure ranging from probability theory to numerical analysis, relational databases and various classical and non-classical logics. It turns out that many interesting models of valuation algebras may be derived from semiring valued mappings. In this paper we study how valuation algebras are induced by semirings and how the structure of the valuation algebra is related to the algebraic structure of the semiring. In particular, c-semirings with idempotent multiplication induce idempotent valuation algebras and therefore permit particularly efficient architectures for local computation. Also important are semirings whose multiplicative semigroup is embedded in a union of groups. They induce valuation algebras with a partially defined division. For these valuation algebras, the well-known architectures for Bayesian networks apply. We also extend the general computational framework to allow derivation of bounds and approximations, for when exact computation is not feasible. © 2008 Elsevier B.V. All rights reserved.
منابع مشابه
Generic local computation
Many problems of artificial intelligence, or more generally, many problems of information processing, have a generic solution based on local computation on join trees or acyclic hypertrees. There are several variants of this method all based on the algebraic structure of valuation algebras. A strong requirement underlying this approach is that the elements of a problem decomposition form a join...
متن کاملAnytime Inference in Valuation Algebras
The novel contribution of this work is the construction of anytime algorithms in a generic framework, which automatically gives us instantiations in many useful domains. We also show that semiring induced valuation algebras, an important subclass of valuation algebras are amenable to anytime inference. Anytime inference, and inference algorithms in general have been a well-researched area in th...
متن کاملCube Summing, Approximate Inference with Non-Local Features, and Dynamic Programming without Semirings
We introduce cube summing, a technique that permits dynamic programming algorithms for summing over structures (like the forward and inside algorithms) to be extended with non-local features that violate the classical structural independence assumptions. It is inspired by cube pruning (Chiang, 2007; Huang and Chiang, 2007) in its computation of non-local features dynamically using scored k-best...
متن کاملComputation in Valuation Algebras
Many different formalisms for treating uncertainty or, more generally, information and knowledge, have a common underlying algebraic structure. The essential algebraic operations are combination, which corresponds to aggregation of knowledge, and marginalization, which corresponds to focusing of knowledge. This structure is called a valuation algebra. Besides managing uncertainty in expert syst...
متن کاملA generic Architecture for local Computation
Valuation algebras are known to present a common roof over various applications out of different domains of research. In combination with the power of local computation it offers a possibility to solve inference problems in an efficient way. Implementing concretely these concepts by instantiating a valuation algebra means loosing the high level of abstraction. This paper presents a generic real...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 172 شماره
صفحات -
تاریخ انتشار 2008